Cdam Lse-cdam-2007-35 Glauber Dynamics for the Mean-field Ising Model: Cut-off, Critical Power Law, and Metastability

نویسندگان

  • DAVID A. LEVIN
  • MALWINA J. LUCZAK
  • YUVAL PERES
چکیده

A. We study the Glauber dynamics for the Ising model on the complete graph, also known as the Curie-Weiss Model. For β < 1, we prove that the dynamics exhibits a cut-off: the distance to stationarity drops from near 1 to near 0 in a window of order n centered at [2(1 − β)]−1n log n. For β = 1, we prove that the mixing time is of order n3/2. For β > 1, we study metastability. In particular, we show that the Glauber dynamics restricted to states of non-negative magnetization has mixing time O(n log n).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Glauber Dynamics for the Mean-field Ising Model: Cut-off, Critical Power Law, and Metastability

A. We study the Glauber dynamics for the Ising model on the complete graph, also known as the Curie-Weiss Model. For β < 1, we prove that the dynamics exhibits a cut-off: the distance to stationarity drops from near 1 to near 0 in a window of order n centered at [2(1 − β)]−1n log n. For β = 1, we prove that the mixing time is of order n3/2. For β > 1, we study metastability. In particula...

متن کامل

Glauber Dynamics for the Mean-field Potts Model

We study Glauber dynamics for the mean-field (Curie-Weiss) Potts model with q > 3 states and show that it undergoes a critical slowdown at an inverse-temperature βs(q) strictly lower than the critical βc(q) for uniqueness of the thermodynamic limit. The dynamical critical βs(q) is the spinodal point marking the onset of metastability. We prove that when β < βs(q) the mixing time is asymptotical...

متن کامل

CDAM research report LSE-CDAM-2007-37 RANDOM SUBGRAPHS OF THE 2D HAMMING GRAPH: THE SUPERCRITICAL PHASE

We study random subgraphs of the 2-dimensional Hamming graph H(2, n), which is the Cartesian product of two complete graphs on n vertices. Let p be the edge probability, and write p = 1+ε 2(n−1) for some ε ∈ R. In [4, 5], the size of the largest connected component was estimated precisely for a large class of graphs including H(2, n) for ε ≤ ΛV −1/3, where Λ > 0 is a constant and V = n denotes ...

متن کامل

Stable Ranks of Banach Algebras of Operator-valued H Functions

Let E be an infinite-dimensional Hilbert space, and let H L(E) denote the Banach algebra of all functions f : D → L(E) that are holomorphic and bounded, equipped with the supremum norm ‖f‖∞ := supz∈D ‖f(z)‖L(E), f ∈ H ∞ L(E). We show that the Bass and topological stable ranks of H L(E) are infinite. If S is an open subset of T, then let A S L(E) denote the subalgebra of H L(E) of all functions ...

متن کامل

CDAM research report LSE-CDAM-2007-40 ASYMPTOTIC NORMALITY OF THE k-CORE IN RANDOM GRAPHS

We study the k-core of a random (multi)graph on n vertices with a given degree sequence. In our previous paper [18] we used properties of empirical distributions of independent random variables to give a simple proof of the fact that the size of the giant k-core obeys a law of large numbers as n→∞. Here we develop the method further and show that the fluctuations around the deterministic limit ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008